Fairness and control

Fairness for Dynamic Control

Already in Lamport’s bakery algorithm, integers are used for fair schedulers of concurrent processes. In this paper, we present the extension of a fair scheduler from ‘static control’ (the number of processes is fixed) to ‘dynamic control’ (the number of processes changes during execution). We believe that our results shed new light on the concept of fairness in the setting of dynamic control.

Fairness and the Axioms of Control Predicates @bullet Fairness and the Axioms of Control Predicates

Many recent axiomatic definitions for structured programming languages include control predicates, which are an abstraction of location counters. The usual axioms identify control locations so as to imply that "no time" is needed to pass from the end of one statement to the next, and in particular from the end of a loop body back to the test at the head of the loop. Although this is reasonable ...

Efficiency and Fairness in Air Traffic Control

Air Traffic Control Planning is a complex area of research in which there is a great need for new and efficient coordination techniques. The tight connection between several parties with different interests makes it a typical and challenging area for the application of multiagent techniques. We study the relation between two important underlying principles in airport traffic planning, namely ut...

Expanded HTA: Enhancing Fairness and Legitimacy

All societies face the need to make judgments about what interventions (both public health and personal medical) to provide to their populations under reasonable resource constraints. Their decisions should be informed by good evidence and arguments from health technology assessment (HTA). But if HTA restricts itself to evaluations of safety, efficacy, and cost-effectiveness, it risks being vie...

Correction: Expanded HTA: Enhancing Fairness and Legitimacy